Several problems in applied mathematics and statistics require integrating a function f over a high-dimensional domain. For example, estimating the partition function of a graphical model for a fixed set of parameters re

Source URL: mmds-data.org

Principal Partition and the Matroid Secretary Problem Jose´ A. Soto Department of Mathematics M.I.T.

Source URL: www.dim.uchile.cl

• Matroid theory
• Matroid
• Partition of a set
• Uniform matroid

Annals of Mathematics and Artificial Intelligence–A boundary-sensitive approach to qualitative location Thomas Bittner a and John G. Stell b

Source URL: www.thomasebittner.com

• Combinatorics
• Partition of a set
• Constructible universe
• Rough set
• Ordinal number
• Functional analysis
• -automaton

A Unified Theory of Granularity, Vagueness, and Approximation Thomas Bittner and Barry Smith Department of Computer Science, Northwestern University, Department of Philosophy, State University of New Y

Source URL: www.acsu.buffalo.edu

• Combinatorics
• Number theory
• Arithmetic functions
• Partition of a set
• Partition
• Equivalence relation
• Mathematical object
• Vagueness
• Perception
• Mereology

Math Primer Andrzej Wasowski ˛ February 12, 2007 Please, report all the bugs you can spot to the author!

Source URL: itu.dk

• Functions and mappings
• Equivalence relation
• Equivalence class
• Binary relation
• Equality
• Surjective function
• Bijection
• injection and surjection
• Bijection
• Partition of a set
• Transitive relation
• Injective function
• Cardinality

Genome Informatics 12: 93–A Graph-Based Clustering Method for a Large Set of Sequences Using a Graph Partitioning Algorithm

Source URL: www.jsbi.org

• Bioinformatics
• Sequence clustering
• Cluster analysis
• Hierarchical clustering
• Graph partition
• Single-linkage clustering
• InterPro
• Matching
• HCS clustering algorithm
• Correlation clustering

JMLR: Workshop and Conference Proceedings vol 40:1–33, 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery ∗ Peter Chin

Source URL: jmlr.org

• Mathematics
• Graph theory
• Discrete mathematics
• NP-complete problems
• Combinatorics
• Partition of a set
• Planar separator theorem
• Graph coloring

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

BELL NUMBERS, PARTITION MOVES AND THE EIGENVALUES OF THE RANDOM-TO-TOP SHUFFLE IN DYNKIN TYPES A, B AND D JOHN R. BRITNELL AND MARK WILDON Abstract. Let Bt (n) be the number of set partitions of a set of size t into at m

Source URL: www.ma.rhul.ac.uk

THEOREM OF THE DAY Kneser’s Conjecture Let Cn,k , 1 ≤ 2k − 1 ≤ n, denote the set of all k-element subsets of {1, . . . , n}. Let C1 ∪ . . . ∪ Ct = Cn,k , 1 ≤ t, be a partition of Cn,k such that any two sets

Source URL: www.theoremoftheday.org